Universality of the homotopy interleaving distance
نویسندگان
چکیده
As a step towards establishing homotopy-theoretic foundations for topological data analysis (TDA), we introduce and study homotopy interleavings between filtered spaces. These are homotopy-invariant analogues of interleavings, objects commonly used in TDA to articulate stability inference theorems. Intuitively, whereas strict interleaving spaces X X Y"> Y encoding="application/x-tex">Y certifies that approximately isomorphic, homotopy weakly equivalent. The main results this paper interleavings induce an extended pseudometric alttext="d Subscript upper H I"> d H I encoding="application/x-tex">d_{HI} on spaces, is the universal satisfying natural invariance axioms. To motivate these axioms, also observe (or more generally, any two axioms additional “homology bounding” axiom) can be formulate lifts several fundamental theorems from algebraic (homological) level Finally, consider problem persistent Whitehead theorem terms interleavings. We provide counterexample naive formulation result.
منابع مشابه
Universality of the Homotopy Interleaving Distance
As a step towards establishing homotopy-theoretic foundations for topological data analysis (TDA), we introduce and study homotopy interleavings between filtered topological spaces. These are homotopy-invariant analogues of interleavings, objects commonly used in TDA to articulate stability and inference theorems. Intuitively, whereas a strict interleaving between filtered spaces X and Y certif...
متن کاملComputational Complexity of the Interleaving Distance
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show that the interleaving distance is NP-hard to compute for persistence modules valued in the category of vector spaces. In the specific setting of multidimensio...
متن کاملInterleaving Distance between Merge Trees
Merge trees are topological descriptors of scalar functions. They record how the subsets of the domain where the function value does not exceed a given threshold are connected. We define a distance between merge trees, called an interleaving distance, and prove the stability of these trees, with respect to this distance, to perturbations of the functions that define them. We show that the inter...
متن کاملThe Persistent Homotopy Type Distance
We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that is necessary to apply to one of the two functions in order that the sublevel sets of the two functions become homotopically equivalent. This distance is inte...
متن کاملThe Theory of the Interleaving Distance on Multidimensional Persistence Modules
Building on an idea of Chazal et al. [11], we introduce and study the interleaving distance, a pseudometric on isomorphism classes of multidimensional persistence modules. We present five main results about the interleaving distance. First, we show that in the case of ordinary persistence, the interleaving distance is equal to the bottleneck distance on tame persistence modules. Second, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2023
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8738